package 代码记录.Bit48天集训;

import java.math.BigInteger;
import java.util.Scanner;

/**1.跳台阶拓展问题(leetcode爬楼梯延申)
 * 2.快到碗里来(已搞定)
 * @author zx
 * @create 2022-05-24 15:11
 */
public class day_26 {
    /**
     * 这又有难度了,这其实是一个完全背包问题(代码回想录)
     * @return
     */
    public int jumpFloorII (int number) {
        int[] dp = new int[number + 1];
        dp[0] = 1;
        for(int i = 0;i <= number;i++){
            for(int j = 1;j <= 20;j++){
                if(i - j >= 0){
                    dp[i] += dp[i - j];
                }
            }
        }
        return dp[number];
    }

    /**
     * @param args 考查大数据处理
     */
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        while(sc.hasNext()){
            String str = sc.nextLine();
            String[] arr = str.split(" ");
            String str1 = arr[0];
            String str2 = arr[1];
            BigInteger a = new BigInteger(str1);
            BigInteger b = new BigInteger(str2);
            BigInteger c = new BigInteger("628");
            BigInteger e = new BigInteger("100");
            BigInteger d = (b.multiply(c)).divide(e);
            int res = a.compareTo(d);
            if(res >= 0){
                System.out.println("No");
            }else{
                System.out.println("Yes");
            }
        }
    }
}
